A Matrix Version of the Fast Multipole Method
نویسندگان
چکیده
We present a matrix interpretation of the three-dimensional fast multipole method (FMM). The FMM is for efficient computation of gravitational/electrostatic potentials and fields. It has found various applications and inspired the design of many efficient algorithms. The one-dimensional FMM is well interpreted in terms of matrix computations. The threedimensional matrix version reveals the underlying matrix structures and computational techniques used in FMM. It also provides a unified view of algorithm variants as well as existing and emerging implementations of the FMM.
منابع مشابه
Experiments on Iterative Methods and the Fast Multipole Method in Electromagnetic Scattering Calculations
We describe the iterative solution of dense linear systems arising from a surface integral equation of electromagnetic scattering. The complex symmetric version of QMR has been used as an iterative solver together with a sparse approximate inverse preconditioner. The preconditioner is computed using the topological information from the computational mesh. The matrix-vector products are computed...
متن کاملJustification of the Fast Multipole Method for the Stokes System
The fast multipole method is one of the most efficient methods to compute matrix-vector multiplications and accelerate the solution of linear systems of equations. In this paper, we provide all necessary theoretical statements concerning the hydrodynamical double layer potential, which enable the application of an adaptive version of the fast multipole method of Greengard and Rokhlin to the int...
متن کاملA Comparative Study of Multipole and Empirical Relations Methods for Effective Index and Dispersion Calculations of Silica-Based Photonic Crystal Fibers
In this paper, we present a solid-core Silica-based photonic crystal fiber (PCF) composed of hexagonal lattice of air-holes and calculate the effective index and chromatic dispersion of PCF for different physical parameters using the empirical relations method (ERM). These results are compared with the data obtained from the conventional multipole method (MPM). Our simulation results reveal tha...
متن کاملAn Overview of Fast Multipole Methods
We present some background and results from the body of work collectively referred to as fast multipole methods (FMM). These comprise a set of techniques for speeding up so-called N -body problems, in which a potential function composed of a sum of pairwise interaction terms from N points is evaluated at an equally large number of locations. We present these methods from the viewpoint of low-ra...
متن کاملMultilevel Fast Multipole Algorithmfor Solving Combined Field
The fast multipole method (FMM) has been implemented to speed up the matrix-vector multiply when an iterative method is used to solve combined eld integral equation (CFIE). FMM reduces the complexity from O(N 2) to O(N 1:5). With a multilevel fast multipole algorithm (MLFMA), it is further reduced to O(NlogN). A 110,592 unknown problem can be solved within 24 hours on a SUN Sparc10.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM Review
دوره 43 شماره
صفحات -
تاریخ انتشار 2001